reachability graph

Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.

可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。

Petri net is a kind of good tool to describe concurrent and asynchronous system, there are many methods to analyze Petri net, such as reachability graph, reachability tree, incidence matrix and so on. However, its correctness can be proved by mathematics method.

Petri网是一个描述异步并发的图形工具，具有可达树、可达图、关联矩阵等多种分析方法，并且可以通过数学方法来证明其正确性；

Reachability matrix of directed graph and calculation based on matrix calculation

基于布尔矩阵运算的有向图可达矩阵

The method need not analyze reachability graph and its online computation has only a complexity of polynomial times. More importantly, the method can be applied to more general Petri nets than existing similar methods.

该方法无需进行可达图分析，在线计算复杂性仅为多项式级，而且与已有方法相比可以应用到更一般的Petri网。

Then some analysis techniques of Petri net such as reachability graph are used to verify the two new features in the system arid we can obtain a number of important properties of the system.

接着使用可达图等Petri网分析技术对系统中的两种新功能进行验证，从而得到系统的若干重要性质。

The load balanced FMS scheduling method based on Petri Net get result by searching models reachability graph using AI technique.

基于Petri的FMS负载平衡调度，以Petri网为建模工具，利用人工智能搜索模型可达图，获得调度结果。采用TPPN构造各生产单元的PN子网，通过共享资源库将其连接。

So a certification management flow modeling is designed based on Petri-net'P/ T system. Its integrity is analysed by the theory of state reachability graph.

文中使用Petri网理论中的库所/变迁系统模型对一个CA证书管理流程进行建模，并用状态可达图理论对其系统的完备性进行了分析与证明。

An Approach to Construction of Reachability Graph of Petri Net

一种构造Petri网可达图的方法

FLS: A Labeling Scheme to Solve the Reachability Problem of Dynamic Updating Graph

FLS：一种支持更新的图可达性标记算法

Temporal Property Analysis of Discrete Event Systems Based on State Reachability Graph

基于状态可达图的离散事件系统时态性质分析

In this paper, an analysis method on input buffer limitation is discussed, and its generalized stochastic Petri nets model and reachability graph are built. Therefore, input buffer limitation mechanism can be described and analyzed.

提出了一种限制输入缓存器方案的广义随机Petri网模型，并给出了可达图及MC，从而可描述、分析限制输入缓存器方案的入口模式。

In the view of analysis method, the reduction rule of CPN was extended, which is integrated with the reachability graph to check the liveness and bound properties of interactive protocol model.

在交互协议分析方面，对CPN模型简化规则进行了扩展，提出了集成简化规则和可达图的定性分析方法。

For quantitative solution, we study GSPN and find that the reachability graph of a GSPN is isomorphic to a Continuous Time Markov Process ( CTMP) when the vanishing markings are eliminated, so Markov Process method can be used.

在安全性定量分析方面，我们研究发现去除消失标识后，GSPN的可达图与一个连续时间Markov过程（CTMP）是同构的，为此，可利用Markov过程方法进行分析。

The reachability matrix of directed graph plays a very important role on identifying whether a directed graph to be strongly connected or not and calculating the strongly connected sub graph.

图的可达性矩阵在判断图的强连通性以及求强连通分图中具有重要作用。